Methods for Accelerating Conway's Doomsday Algorithm (part 1)
نویسنده
چکیده
We propose a modification of a key component in the Doomsday Algorithm for calculating the day of the week of any given date. In particular, we propose to replace the calculation of the required expression: with where x is an input 2-digit year; y is the tens digit of x; z is the ones digit of x; We argue the fact that our modification operates on individual base-10 digits makes the algorithm easier to calculate mentally.
منابع مشابه
Methods for Accelerating Conway's Doomsday Algorithm (part 2)
The Doomsday algorithm is an algorithm for determining the day of the week for any calendar date. It is simple enough that, with practice, it can be done mentally without paper or pencil. Just like in part 1 of this paper, we would like to suggest a modification to the calculation of the doomsyear component of the Doomsday algorithm. We call this proposed method the Odd+11 method. For compariso...
متن کاملThe Doomsday Argument in Many Worlds
You and I are highly unlikely to exist in a civilization that has produced only 70 billion people, yet we find ourselves in just such a civilization. Our circumstance, which seems difficult to explain, is easily accounted for if (1) many other civilizations exist and if (2) nearly all of these civilizations (including our own) die out sooner than usually thought, i.e., before trillions of peopl...
متن کاملPrediction of Driver’s Accelerating Behavior in the Stop and Go Maneuvers Using Genetic Algorithm-Artificial Neural Network Hybrid Intelligence
Research on vehicle longitudinal control with a stop and go system is presently one of the most important topics in the field of intelligent transportation systems. The purpose of stop and go systems is to assist drivers for repeatedly accelerate and stop their vehicles in traffic jams. This system can improve the driving comfort, safety and reduce the danger of collisions and fuel consumption....
متن کاملDoomsday Equilibria for Games on Graphs∗
Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games. In this paper we propose a...
متن کاملFour Problems about Self-Locating Belief
In this article I defend the Doomsday Argument, the Halfer Position in Sleeping Beauty, the Fine-Tuning Argument, and the applicability of Bayesian confirmation theory to the Everett interpretation of quantum mechanics. I will argue that all four problems have the same structure, and I give a unified treatment that uses simple models of the cases and no controversial assumptions about confirmat...
متن کامل